Coded Multi-dimensional Spreading System using the Discrete Fourier Transform
نویسندگان
چکیده
منابع مشابه
Digital image Watermarking using Two Dimensional Discrete Wavelet Transform, Discrete Cosine Transform and Fast Fourier Transform
Abstract—In digital watermarking, a watermark is embedded into a cover text in such a way that the resulting watermarked signal is robust to certain distortion caused by either standard data processing in a friendly environment or malicious attacks in an unfriendly environment. This paper presents a digital image watermarking based on two dimensional discrete cosines transform (DCT2), two dimen...
متن کاملMulti-dimensional Graph Fourier Transform
Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are “multidimensional” and have directional characteristics along each factor graph. However, the existing graph Fourier transform does not distinguish these directions, and assigns 1-D spectra to signals on product graphs. Furthe...
متن کاملTwo dimensional discrete fractional Fourier transform
Fractional Fourier transform (FRFT) performs a rotation of signals in the time—frequency plane, and it has many theories and applications in time-varying signal analysis. Because of the importance of fractional Fourier transform, the implementation of discrete fractional Fourier transform will be an important issue. Recently, a discrete fractional Fourier transform (DFRFT) with discrete Hermite...
متن کاملSpectrum Analysis Using the Discrete Fourier Transform ∗
The discrete Fourier transform (DFT) maps a nite number of discrete time-domain samples to the same number of discrete Fourier-domain samples. Being practical to compute, it is the primary transform applied to real-world sampled data in digital signal processing. The DFT has special relationships with the discrete-time Fourier transform and the continuous-time Fourier transform that let it be u...
متن کاملThe Discrete Fourier Transform∗
1 Motivation We want to numerically approximate coefficients in a Fourier series. The first step is to see how the trapezoidal rule applies when numerically computing the integral (2π) −1 2π 0 F (t)dt, where F (t) is a continuous, 2π-periodic function. Applying the trapezoidal rule with the stepsize taken to be h = 2π/n for some integer n ≥ 1 results in (2π) −1 2π 0 F (t)dt ≈ 1 n n−1 j=0 Y j , ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communication and Information Systems
سال: 2008
ISSN: 1980-6604
DOI: 10.14209/jcis.2008.6